By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 17, Issue 2, pp. v-426

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Preface

Zvi Galil

pp. v-vii

How to Generate Factored Random Numbers

Eric Bach

pp. 179-193

RSA and Rabin Functions: Certain Parts are as Hard as the Whole

Werner Alexi, Benny Chor, Oded Goldreich, and Claus P. Schnorr

pp. 194-209

Privacy Amplification by Public Discussion

Charles H. Bennett, Gilles Brassard, and Jean-Marc Robert

pp. 210-229

Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity

Benny Chor and Oded Goldreich

pp. 230-261

Reconstructing Truncated Integer Variables Satisfying Linear Congruences

Alan M. Frieze, Johan Hastad, Ravi Kannan, Jeffrey C. Lagarias, and Adi Shamir

pp. 262-280

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest

pp. 281-308

Complexity Measures for Public-Key Cryptosystems

Joachim Grollmann and Alan L. Selman

pp. 309-335

Solving Simultaneous Modular Equations of Low Degree

Johan Hastad

pp. 336-341

Unique Extrapolation of Polynomial Recurrences

Jeffrey C. Lagarias and James A. Reeds

pp. 342-362

The Discrete Logarithm Hides $O(\log n)$ Bits

Douglas L. Long and Avi Wigderson

pp. 363-372

How to Construct Pseudorandom Permutations from Pseudorandom Functions

Michael Luby and Charles Rackoff

pp. 373-386

A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm

Carl Pomerance, J. W. Smith, and Randy Tuler

pp. 387-403

Efficient Parallel Pseudorandom Number Generation

J. H. Reif and J. D. Tygar

pp. 404-411

The Notion of Security for Probabilistic Cryptosystems

Silvio Micali, Charles Rackoff, and Bob Sloan

pp. 412-426